Finding Frequent Patterns in a String in Sublinear Time
نویسندگان
چکیده
We consider the problem of testing whether (a large part of) a given string X of length n over some finite alphabet is covered by multiple occurrences of some (unspecified) pattern Y of arbitrary length in the combinatorial property testing model. Our algorithms randomly query a sublinear number of positions of X, and run in sublinear time in n. We first focus on finding patterns of a given length, and then discuss finding patterns of unspecified length.
منابع مشابه
Efficient parameterized string matching
In parameterized string matching the pattern P matches a substring t of the text T if there exist a bijective mapping from the symbols of P to the symbols of t . We give simple and practical algorithms for finding all such pattern occurrences in sublinear time on average. The algorithms work for a single and multiple patterns. © 2006 Elsevier B.V. All rights reserved.
متن کاملMining Frequent Patterns in Uncertain and Relational Data Streams using the Landmark Windows
Todays, in many modern applications, we search for frequent and repeating patterns in the analyzed data sets. In this search, we look for patterns that frequently appear in data set and mark them as frequent patterns to enable users to make decisions based on these discoveries. Most algorithms presented in the context of data stream mining and frequent pattern detection, work either on uncertai...
متن کاملOnline Grammar Compression for Frequent Pattern Discovery
Various grammar compression algorithms have been proposed in the last decade. A grammar compression is a restricted CFG deriving the string deterministically. An efficient grammar compression develops a smaller CFG by finding duplicated patterns and removing them. This process is just a frequent pattern discovery by grammatical inference. While we can get any frequent pattern in linear time usi...
متن کاملOn the Worst-Case Behavior of String-Searching Algorithms
Any algorithm for finding a pattern of length k in a string of length n must examine at least n k + of the characters of the string in the worst case. By considering the pattern 00 0, we prove that this is the best possible result. Therefore there do not exist pattern matching algorithms whose worst-case behavior is "sublinear" in n (that is, linear with constant less than one), in contrast wit...
متن کاملConstant-Space String-Matching in Sublinear Average Time
Given two strings: pattern P of lengthm and text T of length n. The stringmatching problem is to nd all occurrences of the pattern P in the text T . We present a simple string-matching algorithms which works in average o(n) time with constant additional space for one-dimensional texts and two-dimensional arrays. This is the rst attempt to the small-space string-matching problem in which subline...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005